Weight distributions of some classes of binary cyclic codes (Corresp.)
نویسندگان
چکیده
Let h l (x)h2 (x) be the parity check polynomial of a binary cyclic code. This article presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity check polynomials are hl(x) and h 2 (x). This decomposition provides information about the weight distribution of the code. This work was supported by National Science Foundation Grants GK-37449 and GK-34915.
منابع مشابه
On the weight distribution of the duals of irreducible cyclic codes, cyclic codes with two zeros and hyper-Kloosterman codes
This paper considers the weight distributions of binary cyclic codes with one or two zeros and hyper-Kloosterman codes. The results on value distributions of certain monomial exponential sums and connections between exponential sums and Kloosterman sums are applied together with the Pless power moment identity in these conciderations. Explicit formulae for the number of low-weight codewords are...
متن کاملThe weight distributions of some cyclic codes with three or four nonzeros over 𝔽3
Because of efficient encoding and decoding algorithms, cyclic codes are an important family of linear block codes, and have applications in communication and storage systems. However, their weight distributions are known only for a few cases mainly on the codes with one or two nonzeros. In this paper, the weight distributions of two classes of cyclic codes with three or four nonzeros are determ...
متن کاملConstructions of binary constant-weight cyclic codes and cyclically permutable codes
A general theorem is proved showing how to ohtain a constant-weight binary cyclic code from a p-ary linear cyclic code, where p is a prime,. by using a representation of Cl;(p) as cyclic shifts of a binary p-tuple. Based on this theorem, constructions are given for four classes of binary constant-weight codes. The first two classes are shown to achieve the Johnson upper bound on minimum distanc...
متن کاملSome results on the weight structure of cyclic codes of composite length
In this work we investigate the weight structure of cyclic codes of composite length n = n l n 2 , where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cy...
متن کاملFamilies of Curves and Weight Distributions of Codes
In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the distribution of the number of rational points on the curves.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 21 شماره
صفحات -
تاریخ انتشار 1975